Stochastic Network Problems: Massively Parallel Solution
نویسنده
چکیده
منابع مشابه
Solving multistage stochastic network programs on massively parallel computers
Multi-stage stochastic programs are typically extremely large, and can be prohibitively expensive to solve on the computer. In this paper we develop an algorithm for multistage programs that integrates the primal-dual row-action framework with prox-imal minimization. The algorithm exploits the structure of stochastic programs with network recourse, using a suitable problem formulation based on ...
متن کاملMassively Parallel Asset and Liability Management
Multistage Stochastic Programming is a popular method to solve financial planning problems such as Asset and Liability Management (ALM). The desirability to have future scenarios match static and dynamic correlations between assets leads to problems of truly enormous sizes (often reaching tens of millions of unknowns or more). Clearly parallel processing becomes mandatory to deal with such prob...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure.
In series-parallel SPN, the completion time distribution...
متن کامل3 Massively Parallel Adi Algorithms for Net - Work Flow
Two massively parallel algorithms for large scale linear and convex quadratic network ow problems are proposed and studied. The methods are based on the alternating step method for monotropic programming. The original network ow problem is decomposed in simple subproblems involving only few variables for which solution in closed form exists. Computational results obtained on the CRAY T3D show t...
متن کاملA special Class of Stochastic PERT Networks
Considering the network structure is one of the new approaches in studying stochastic PERT networks (SPN). In this paper, planar networks are studied as a special class of networks. Two structural reducible mechanisms titled arc contraction and deletion are developed to convert any planar network to a series-parallel network structure. In series-parallel SPN, the completion time distribution f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009